Approximate covering detection among content-based subscriptions using space filling curves
نویسندگان
چکیده
منابع مشابه
Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves
We consider a problem that arises during the propagation of subscriptions in a contentbased publish-subscribe system. Subscription covering is a promising optimization that reduces the number of subscriptions propagated, and hence the size of routing tables in a contentbased publish-subscribe system. However, detecting covering relationships among subscriptions can be an expensive computational...
متن کاملContext-based Space Filling Curves
A context-based scanning technique for images is presented. An image is scanned along a context-based space filling curve that is computed so as to exploit inherent coherence in the image. The resulting one-dimensional representation of the image has improved autocorrelation compared with universal scans such as the PeanoHilbert space filling curve. An efficient algorithm for computing context-...
متن کاملUsing Space-filling Curves for Computation Reordering
Space-filling curves have been widely used in mathematics and to transform multi-dimensional problems into one-dimensional forms. For scientific applications, ordering data or computation along spacefilling curves can be useful for exploiting locality when partitioning onto parallel systems or when restructuring to exploit memory hierarchy. In this paper, we present an efficient approach for en...
متن کاملDynamic Load Balancing Using Space-Filling Curves
Space-filling curves (SFCs) provide a continuous mapping from a one-dimensional to a d-dimensional space and have been used to linearize spatially distributed data for partitioning, memory management and image processing. This paper gives a short introduction to the concept of SFCs and highlights some of the applications found in computer science. The main focus will be on dynamic distribution ...
متن کاملNeighbor-finding based on space-filling curves
Nearest neighbor-finding is one of the most important spatial operations in the field of spatial data structures concerned with proximity. Because the goal of the space-filling curves is to preserve the spatial proximity, the nearest neighbor queries can be handled by these space-filling curves. When data is ordered by the Peano curve, we can directly compute the sequence numbers of the neighbo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2012
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2012.09.002